Expressive, Efficient Instance Variables

نویسندگان

  • Jeffrey Dean
  • David Grove
  • Craig Chambers
  • Vassily Litvinov
چکیده

The decoupling of clients of abstractions from the implementations of those abstractions is a key benefit of objectoriented programming. However, many object-oriented languages provide instance variables in such a way that implementation-level representation decisions seep through interfaces, introducing coupling between clients and abstractions. As part of the Cecil language, we have developed a semantics for flexible instance variables based on the principle that a class should be decoupled from its clients, its subclasses, and its role extensions. We describe our design of instance variables and provide examples where their additional flexibility has been useful. However, implementing our semantics naively can impose significant performance penalties. To achieve reasonable performance, we have developed a number of optimizations that are effective at eliminating many of the costs of our flexible model. We discuss these optimizations and report on the results of experiments to assess the costs of our design under different optimization scenarios.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient instance retrieval over semi-expressive ontologies

In the last years, the vision of the Semantic Web fostered the interest in reasoning over growing sets of assertional statements in ontologies. Traditional tableau-based reasoning systems have problems to answer queries over large ontological data sets because these reasoning systems are based on efficient use of main memory data structures. Increasing expressivity and worst-case complexity fur...

متن کامل

Approximate Instance Retrieval on Ontologies

With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexity for efficient reasoning. In application cases that require scalable reasoning with expressive ontologies, non-standard reasoning solutions such as approximate reasoning are necessary to tackle the intractability of...

متن کامل

An Instance Based Model for Generating Expressive Performance during Composition

We detail our work on a multi-agent model for the generation of structurally expressive music performance. It is a combined performance and composition system which attempts to implement the common observation in expressive music performance studies that performers slow down at boundaries in a musical piece, with the amount of slowing down being larger when the boundary is more significant. Bec...

متن کامل

Towards ABox Modularization of semi-expressive Description Logics

In the last years, the vision of the Semantic Web fostered the interest in reasoning over large and very large sets of assertional statements in knowledge bases. Traditional tableau-based reasoning systems perform bad answering queries over large data sets, because these reasoning systems are based on efficient use of main memory data structures. Increasing expressivity and worstcase complexity...

متن کامل

Graphical Models for Structured Classification, with an Application to Interpreting Images of Protein Subcellular Location Patterns

In structured classification problems, there is a direct conflict between expressive models and efficient inference: while graphical models such as Markov random fields or factor graphs can represent arbitrary dependences among instance labels, the cost of inference via belief propagation in these models grows rapidly as the graph structure becomes more complicated. One important source of comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996